Sequent calculus for logic of correlated knowledge
نویسندگان
چکیده
منابع مشابه
Sequent Calculus for Intuitionistic Logic
We present a system of sequent calculus for intuitionistic propositional logic. In later chapters we obtain stronger systems by adding rules to this basic system, and we therefore go through its proof-theoretical properties in detail, in particular the admissibility of structural rules and the basic consequences of cut elimination. Many of these properties can then be verified in a routine fash...
متن کاملA Sequent Calculus for Intuitionistic Default Logic
Current research on non-monotonic reasoning shows growing interest on implementation details, so the need for concrete calculi formalizing non-monotonic logics is clearly recognized. On the other hand, there is also an increased number of works combining intuitionistic logic with various kinds of non-monotonic formalisms. As a case in point, intuitionistic versions of both default and autoepist...
متن کاملA Sequent Calculus for Dynamic Topological Logic
We introduce a sequent calculus for the temporal-over-topological fragment DTL ◦∗/2 0 of dynamic topological logic DTL, prove soundness semantically, and prove completeness syntactically using the axiomatization of DTL ◦∗/2 0 given in [3]. A cut-free sequent calculus for DTL ◦∗/2 0 is obtained as the union of the propositional fragment of Gentzen’s classical sequent calculus, two 2 structural r...
متن کاملSuppes-style sequent calculus for probability logic
Deduction relation naturally connecting a set Γ of hypotheses with a conclusion A, usually denoted by Γ ` A, presents a basic notion of traditional logic. The framework of approximative and vague reasoning needs a new concept of such a connection enabling to express that ’A follows from Γ with probability p’. In this paper, following the Gentzen’s approach to the formalization of the deduction ...
متن کاملA simple sequent calculus for nominal logic
Nominal logic is a variant of first-order logic that provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the new-quantifier, which quantifies over fresh names (names not appearing in any values considered so far). Previous attempts have been made to develop convenient rules for reasoning with the new-quantifier, but we argue that none of these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lietuvos matematikos rinkinys
سال: 2011
ISSN: 2335-898X,0132-2818
DOI: 10.15388/lmr.2011.ml04